Termination w.r.t. Q proof of /tmp/tmpi4dYJe/ex09.trs

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

f₃(true, x, y) -> f₃(gt₂(x, y), x, round₁(s₁(y)))
round₁(0) -> 0
round₁(s₁(0)) -> s₁(s₁(0))
round₁(s₁(s₁(x))) -> s₁(s₁(round₁(x)))
gt₂(0, v) -> false
gt₂(s₁(u), 0) -> true
gt₂(s₁(u), s₁(v)) -> gt₂(u, v)

The set Q consists of the following terms:

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
f₃(true, x0, x1)
gt₂(s₁(x0), 0)

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f₃(true, x, y) -> f₃(gt₂(x, y), x, round₁(s₁(y)))
round₁(0) -> 0
round₁(s₁(0)) -> s₁(s₁(0))
round₁(s₁(s₁(x))) -> s₁(s₁(round₁(x)))
gt₂(0, v) -> false
gt₂(s₁(u), 0) -> true
gt₂(s₁(u), s₁(v)) -> gt₂(u, v)

The set Q consists of the following terms:

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
f₃(true, x0, x1)
gt₂(s₁(x0), 0)

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F₃(true, x, y) -> F₃(gt₂(x, y), x, round₁(s₁(y)))
F₃(true, x, y) -> GT₂(x, y)
F₃(true, x, y) -> ROUND₁(s₁(y))
GT₂(s₁(u), s₁(v)) -> GT₂(u, v)
ROUND₁(s₁(s₁(x))) -> ROUND₁(x)

The TRS R consists of the following rules:

f₃(true, x, y) -> f₃(gt₂(x, y), x, round₁(s₁(y)))
round₁(0) -> 0
round₁(s₁(0)) -> s₁(s₁(0))
round₁(s₁(s₁(x))) -> s₁(s₁(round₁(x)))
gt₂(0, v) -> false
gt₂(s₁(u), 0) -> true
gt₂(s₁(u), s₁(v)) -> gt₂(u, v)

The set Q consists of the following terms:

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
f₃(true, x0, x1)
gt₂(s₁(x0), 0)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

F₃(true, x, y) -> F₃(gt₂(x, y), x, round₁(s₁(y)))
F₃(true, x, y) -> GT₂(x, y)
F₃(true, x, y) -> ROUND₁(s₁(y))
GT₂(s₁(u), s₁(v)) -> GT₂(u, v)
ROUND₁(s₁(s₁(x))) -> ROUND₁(x)

The TRS R consists of the following rules:

f₃(true, x, y) -> f₃(gt₂(x, y), x, round₁(s₁(y)))
round₁(0) -> 0
round₁(s₁(0)) -> s₁(s₁(0))
round₁(s₁(s₁(x))) -> s₁(s₁(round₁(x)))
gt₂(0, v) -> false
gt₂(s₁(u), 0) -> true
gt₂(s₁(u), s₁(v)) -> gt₂(u, v)

The set Q consists of the following terms:

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
f₃(true, x0, x1)
gt₂(s₁(x0), 0)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 3 SCCs with 2 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ UsableRulesProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

GT₂(s₁(u), s₁(v)) -> GT₂(u, v)

The TRS R consists of the following rules:

f₃(true, x, y) -> f₃(gt₂(x, y), x, round₁(s₁(y)))
round₁(0) -> 0
round₁(s₁(0)) -> s₁(s₁(0))
round₁(s₁(s₁(x))) -> s₁(s₁(round₁(x)))
gt₂(0, v) -> false
gt₂(s₁(u), 0) -> true
gt₂(s₁(u), s₁(v)) -> gt₂(u, v)

The set Q consists of the following terms:

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
f₃(true, x0, x1)
gt₂(s₁(x0), 0)

We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [13] we can delete all non-usable rules [14] from R.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QReductionProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

GT₂(s₁(u), s₁(v)) -> GT₂(u, v)

R is empty.
The set Q consists of the following terms:

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
f₃(true, x0, x1)
gt₂(s₁(x0), 0)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
f₃(true, x0, x1)
gt₂(s₁(x0), 0)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QReductionProof

                  ↳ QDP

                    ↳ QDPSizeChangeProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

GT₂(s₁(u), s₁(v)) -> GT₂(u, v)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [16] together with the size-change analysis [27] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

GT₂(s₁(u), s₁(v)) -> GT₂(u, v)
The graph contains the following edges 1 > 1, 2 > 2

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ROUND₁(s₁(s₁(x))) -> ROUND₁(x)

The TRS R consists of the following rules:

f₃(true, x, y) -> f₃(gt₂(x, y), x, round₁(s₁(y)))
round₁(0) -> 0
round₁(s₁(0)) -> s₁(s₁(0))
round₁(s₁(s₁(x))) -> s₁(s₁(round₁(x)))
gt₂(0, v) -> false
gt₂(s₁(u), 0) -> true
gt₂(s₁(u), s₁(v)) -> gt₂(u, v)

The set Q consists of the following terms:

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
f₃(true, x0, x1)
gt₂(s₁(x0), 0)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QReductionProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ROUND₁(s₁(s₁(x))) -> ROUND₁(x)

R is empty.
The set Q consists of the following terms:

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
f₃(true, x0, x1)
gt₂(s₁(x0), 0)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
f₃(true, x0, x1)
gt₂(s₁(x0), 0)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QReductionProof

                  ↳ QDP

                    ↳ QDPSizeChangeProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ROUND₁(s₁(s₁(x))) -> ROUND₁(x)

From the DPs we obtained the following set of size-change graphs:

ROUND₁(s₁(s₁(x))) -> ROUND₁(x)
The graph contains the following edges 1 > 1

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

            ↳ UsableRulesProof

Q DP problem:
The TRS P consists of the following rules:

F₃(true, x, y) -> F₃(gt₂(x, y), x, round₁(s₁(y)))

The TRS R consists of the following rules:

f₃(true, x, y) -> f₃(gt₂(x, y), x, round₁(s₁(y)))
round₁(0) -> 0
round₁(s₁(0)) -> s₁(s₁(0))
round₁(s₁(s₁(x))) -> s₁(s₁(round₁(x)))
gt₂(0, v) -> false
gt₂(s₁(u), 0) -> true
gt₂(s₁(u), s₁(v)) -> gt₂(u, v)

The set Q consists of the following terms:

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
f₃(true, x0, x1)
gt₂(s₁(x0), 0)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QReductionProof

            ↳ UsableRulesProof

Q DP problem:
The TRS P consists of the following rules:

F₃(true, x, y) -> F₃(gt₂(x, y), x, round₁(s₁(y)))

The TRS R consists of the following rules:

gt₂(0, v) -> false
gt₂(s₁(u), 0) -> true
gt₂(s₁(u), s₁(v)) -> gt₂(u, v)
round₁(s₁(0)) -> s₁(s₁(0))
round₁(s₁(s₁(x))) -> s₁(s₁(round₁(x)))
round₁(0) -> 0

The set Q consists of the following terms:

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
f₃(true, x0, x1)
gt₂(s₁(x0), 0)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

f₃(true, x0, x1)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QReductionProof

                  ↳ QDP

                    ↳ Narrowing

            ↳ UsableRulesProof

Q DP problem:
The TRS P consists of the following rules:

F₃(true, x, y) -> F₃(gt₂(x, y), x, round₁(s₁(y)))

The TRS R consists of the following rules:

gt₂(0, v) -> false
gt₂(s₁(u), 0) -> true
gt₂(s₁(u), s₁(v)) -> gt₂(u, v)
round₁(s₁(0)) -> s₁(s₁(0))
round₁(s₁(s₁(x))) -> s₁(s₁(round₁(x)))
round₁(0) -> 0

The set Q consists of the following terms:

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
gt₂(s₁(x0), 0)

We have to consider all minimal (P,Q,R)-chains.
By narrowing [13] the rule F₃(true, x, y) -> F₃(gt₂(x, y), x, round₁(s₁(y))) at position [0] we obtained the following new rules:

F₃(true, s₁(x0), s₁(x1)) -> F₃(gt₂(x0, x1), s₁(x0), round₁(s₁(s₁(x1))))
F₃(true, s₁(x0), 0) -> F₃(true, s₁(x0), round₁(s₁(0)))
F₃(true, 0, x0) -> F₃(false, 0, round₁(s₁(x0)))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QReductionProof

                  ↳ QDP

                    ↳ Narrowing

                      ↳ QDP

                        ↳ DependencyGraphProof

            ↳ UsableRulesProof

Q DP problem:
The TRS P consists of the following rules:

F₃(true, s₁(x0), 0) -> F₃(true, s₁(x0), round₁(s₁(0)))
F₃(true, s₁(x0), s₁(x1)) -> F₃(gt₂(x0, x1), s₁(x0), round₁(s₁(s₁(x1))))
F₃(true, 0, x0) -> F₃(false, 0, round₁(s₁(x0)))

The TRS R consists of the following rules:

gt₂(0, v) -> false
gt₂(s₁(u), 0) -> true
gt₂(s₁(u), s₁(v)) -> gt₂(u, v)
round₁(s₁(0)) -> s₁(s₁(0))
round₁(s₁(s₁(x))) -> s₁(s₁(round₁(x)))
round₁(0) -> 0

The set Q consists of the following terms:

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
gt₂(s₁(x0), 0)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 1 less node.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QReductionProof

                  ↳ QDP

                    ↳ Narrowing

                      ↳ QDP

                        ↳ DependencyGraphProof

                          ↳ QDP

                            ↳ Rewriting

            ↳ UsableRulesProof

Q DP problem:
The TRS P consists of the following rules:

F₃(true, s₁(x0), 0) -> F₃(true, s₁(x0), round₁(s₁(0)))
F₃(true, s₁(x0), s₁(x1)) -> F₃(gt₂(x0, x1), s₁(x0), round₁(s₁(s₁(x1))))

The TRS R consists of the following rules:

gt₂(0, v) -> false
gt₂(s₁(u), 0) -> true
gt₂(s₁(u), s₁(v)) -> gt₂(u, v)
round₁(s₁(0)) -> s₁(s₁(0))
round₁(s₁(s₁(x))) -> s₁(s₁(round₁(x)))
round₁(0) -> 0

The set Q consists of the following terms:

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
gt₂(s₁(x0), 0)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [13] the rule F₃(true, s₁(x0), s₁(x1)) -> F₃(gt₂(x0, x1), s₁(x0), round₁(s₁(s₁(x1)))) at position [2] we obtained the following new rules:

F₃(true, s₁(x0), s₁(x1)) -> F₃(gt₂(x0, x1), s₁(x0), s₁(s₁(round₁(x1))))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QReductionProof

                  ↳ QDP

                    ↳ Narrowing

                      ↳ QDP

                        ↳ DependencyGraphProof

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ DependencyGraphProof

            ↳ UsableRulesProof

Q DP problem:
The TRS P consists of the following rules:

F₃(true, s₁(x0), 0) -> F₃(true, s₁(x0), round₁(s₁(0)))
F₃(true, s₁(x0), s₁(x1)) -> F₃(gt₂(x0, x1), s₁(x0), s₁(s₁(round₁(x1))))

The TRS R consists of the following rules:

gt₂(0, v) -> false
gt₂(s₁(u), 0) -> true
gt₂(s₁(u), s₁(v)) -> gt₂(u, v)
round₁(s₁(0)) -> s₁(s₁(0))
round₁(s₁(s₁(x))) -> s₁(s₁(round₁(x)))
round₁(0) -> 0

The set Q consists of the following terms:

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
gt₂(s₁(x0), 0)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 1 less node.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QReductionProof

                  ↳ QDP

                    ↳ Narrowing

                      ↳ QDP

                        ↳ DependencyGraphProof

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Instantiation

            ↳ UsableRulesProof

Q DP problem:
The TRS P consists of the following rules:

F₃(true, s₁(x0), s₁(x1)) -> F₃(gt₂(x0, x1), s₁(x0), s₁(s₁(round₁(x1))))

The TRS R consists of the following rules:

gt₂(0, v) -> false
gt₂(s₁(u), 0) -> true
gt₂(s₁(u), s₁(v)) -> gt₂(u, v)
round₁(s₁(0)) -> s₁(s₁(0))
round₁(s₁(s₁(x))) -> s₁(s₁(round₁(x)))
round₁(0) -> 0

The set Q consists of the following terms:

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
gt₂(s₁(x0), 0)

We have to consider all minimal (P,Q,R)-chains.
By instantiating [13] the rule F₃(true, s₁(x0), s₁(x1)) -> F₃(gt₂(x0, x1), s₁(x0), s₁(s₁(round₁(x1)))) we obtained the following new rules:

F₃(true, s₁(z0), s₁(s₁(y_1))) -> F₃(gt₂(z0, s₁(y_1)), s₁(z0), s₁(s₁(round₁(s₁(y_1)))))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QReductionProof

                  ↳ QDP

                    ↳ Narrowing

                      ↳ QDP

                        ↳ DependencyGraphProof

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Instantiation

                                      ↳ QDP

            ↳ UsableRulesProof

Q DP problem:
The TRS P consists of the following rules:

F₃(true, s₁(z0), s₁(s₁(y_1))) -> F₃(gt₂(z0, s₁(y_1)), s₁(z0), s₁(s₁(round₁(s₁(y_1)))))

The TRS R consists of the following rules:

gt₂(0, v) -> false
gt₂(s₁(u), 0) -> true
gt₂(s₁(u), s₁(v)) -> gt₂(u, v)
round₁(s₁(0)) -> s₁(s₁(0))
round₁(s₁(s₁(x))) -> s₁(s₁(round₁(x)))
round₁(0) -> 0

The set Q consists of the following terms:

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
gt₂(s₁(x0), 0)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QReductionProof

Q DP problem:
The TRS P consists of the following rules:

F₃(true, x, y) -> F₃(gt₂(x, y), x, round₁(s₁(y)))

The TRS R consists of the following rules:

gt₂(0, v) -> false
gt₂(s₁(u), 0) -> true
gt₂(s₁(u), s₁(v)) -> gt₂(u, v)
round₁(s₁(0)) -> s₁(s₁(0))
round₁(s₁(s₁(x))) -> s₁(s₁(round₁(x)))
round₁(0) -> 0

The set Q consists of the following terms:

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
f₃(true, x0, x1)
gt₂(s₁(x0), 0)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

f₃(true, x0, x1)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QReductionProof

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₃(true, x, y) -> F₃(gt₂(x, y), x, round₁(s₁(y)))

The TRS R consists of the following rules:

gt₂(0, v) -> false
gt₂(s₁(u), 0) -> true
gt₂(s₁(u), s₁(v)) -> gt₂(u, v)
round₁(s₁(0)) -> s₁(s₁(0))
round₁(s₁(s₁(x))) -> s₁(s₁(round₁(x)))
round₁(0) -> 0

The set Q consists of the following terms:

round₁(s₁(s₁(x0)))
round₁(0)
gt₂(0, x0)
round₁(s₁(0))
gt₂(s₁(x0), s₁(x1))
gt₂(s₁(x0), 0)

We have to consider all minimal (P,Q,R)-chains.